全文获取类型
收费全文 | 1450篇 |
免费 | 24篇 |
国内免费 | 53篇 |
专业分类
化学 | 92篇 |
晶体学 | 1篇 |
力学 | 8篇 |
综合类 | 5篇 |
数学 | 1364篇 |
物理学 | 57篇 |
出版年
2023年 | 33篇 |
2022年 | 30篇 |
2021年 | 27篇 |
2020年 | 40篇 |
2019年 | 67篇 |
2018年 | 35篇 |
2017年 | 27篇 |
2016年 | 13篇 |
2015年 | 23篇 |
2014年 | 41篇 |
2013年 | 118篇 |
2012年 | 33篇 |
2011年 | 103篇 |
2010年 | 96篇 |
2009年 | 155篇 |
2008年 | 141篇 |
2007年 | 81篇 |
2006年 | 78篇 |
2005年 | 35篇 |
2004年 | 39篇 |
2003年 | 44篇 |
2002年 | 36篇 |
2001年 | 28篇 |
2000年 | 22篇 |
1999年 | 15篇 |
1998年 | 28篇 |
1997年 | 16篇 |
1996年 | 16篇 |
1995年 | 15篇 |
1994年 | 7篇 |
1993年 | 8篇 |
1992年 | 9篇 |
1991年 | 7篇 |
1990年 | 6篇 |
1989年 | 3篇 |
1988年 | 3篇 |
1987年 | 1篇 |
1986年 | 12篇 |
1985年 | 6篇 |
1984年 | 7篇 |
1983年 | 3篇 |
1982年 | 6篇 |
1981年 | 5篇 |
1980年 | 2篇 |
1979年 | 1篇 |
1978年 | 3篇 |
1977年 | 2篇 |
1972年 | 1篇 |
排序方式: 共有1527条查询结果,搜索用时 31 毫秒
1.
2.
Liquid-liquid-solid systems are becoming increasingly common in everyday life with many possible applications. Here, we focus on a special case of such liquid-liquid-solid systems, namely, capillary suspensions. These capillary suspensions originate from particles that form a network based on capillary forces and are typically composed of solids in a bulk liquid with an added secondary liquid. The structure of particle networks based on capillary bridges possesses unique properties compared with networks formed via other attractive interactions where these differences are inherently related to the properties of the capillary bridges, such as bridge breaking and coalescence between adjacent bridges. Thus, to tailor the mechanical properties of capillary suspensions to specific requirements, it is important to understand the influences on different length scales ranging from the dynamics of the bridges with varying external stimuli to the often heterogeneous network structure. 相似文献
3.
4.
5.
6.
7.
8.
Andrey A. Dobrynin 《Discrete Mathematics》2019,342(1):74-77
Distance between two vertices is the number of edges in a shortest path connecting them in a connected graph . The transmission of a vertex is the sum of distances from to all the other vertices of . If transmissions of all vertices are mutually distinct, then is a transmission irregular graph. It is known that almost no graphs are transmission irregular. Infinite families of transmission irregular trees of odd order were presented in Alizadeh and Klav?ar (2018). The following problem was posed in Alizadeh and Klav?ar (2018): do there exist infinite families of transmission irregular trees of even order? In this article, such a family is constructed. 相似文献
9.
Christian Bosse 《Discrete Mathematics》2019,342(12):111595
The Hadwiger number of a graph , denoted , is the largest integer such that contains as a minor. A famous conjecture due to Hadwiger in 1943 states that for every graph , , where denotes the chromatic number of . Let denote the independence number of . A graph is -free if it does not contain the graph as an induced subgraph. In 2003, Plummer, Stiebitz and Toft proved that for all -free graphs with , where is any graph on four vertices with , , or is a particular graph on seven vertices. In 2010, Kriesell subsequently generalized the statement to include all forbidden subgraphs on five vertices with . In this note, we prove that for all -free graphs with , where denotes the wheel on six vertices. 相似文献
10.
A path decomposition of a graph is a collection of edge-disjoint paths of that covers the edge set of . Gallai (1968) conjectured that every connected graph on vertices admits a path decomposition of cardinality at most . Gallai’s Conjecture has been verified for many classes of graphs. In particular, Lovász (1968) verified this conjecture for graphs with at most one vertex with even degree, and Pyber (1996) verified it for graphs in which every cycle contains a vertex with odd degree. Recently, Bonamy and Perrett (2016) verified Gallai’s Conjecture for graphs with maximum degree at most 5, and Botler et al. (2017) verified it for graphs with treewidth at most 3. In this paper, we verify Gallai’s Conjecture for triangle-free planar graphs. 相似文献